Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
نویسندگان
چکیده
We investigate Leifer-Milner RPO approach for CCS and πcalculus. The basic category in which we carry out the construction is the category of term contexts. Several issues and problems emerge from this experiment; for them we propose some new solutions.
منابع مشابه
Turning GSOS Rules into Equations for Linear Time-Branching Time Semantics
Labelled transition systems constitute a widely used model of concurrent computation. They model processes by explicitly describing their states and transitions from state to state, together with the actions that produce these transitions. Several notions of behavioural semantics have been proposed, with the aim to identify those states that afford the same observations. In [13], van Glabbeek p...
متن کاملStochastic COWS
A stochastic extension of COWS is presented. First the formalism is given an operational semantics leading to finitely branching transition systems. Then its syntax and semantics are enriched along the lines of Markovian extensions of process calculi. This allows addressing quantitative reasoning about the behaviour of the specified web services. For instance, a simple case study shows that ser...
متن کاملFinitely Branching LTS’s from Reaction Semantics for Process Calculi
We experiment Leifer-Milner RPO approach to CCS and to π-calculus. The basic category in which we carry out the construction is the category of term contexts. Several issues and problems emerge from this experiment; for them we propose some original solutions.
متن کاملar X iv : 0 90 6 . 27 27 v 1 [ cs . P L ] 1 5 Ju n 20 09 RPO , SECOND - ORDER CONTEXTS , AND λ - CALCULUS
First, we extend Leifer-Milner RPO theory, by giving general conditions to obtain IPO labelled transition systems (and bisimilarities) with a reduced set of transitions, and possibly finitely branching. Moreover, we study the weak variant of Leifer-Milner theory, by giving general conditions under which the weak bisimilarity is a congruence. Then, we apply such extended RPO technique to the lam...
متن کاملStructured Operational Semantics for Graph Rewriting
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics (LTS). While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general. Hence, the goal of this article is to obtain a compositional semantics for graph transformation system in analogy to the structural operational se...
متن کامل